TSTP Solution File: ITP192^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP192^1 : TPTP v8.1.2. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:07:16 EDT 2024
% Result : Theorem 205.98s 26.82s
% Output : CNFRefutation 205.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 27
% Syntax : Number of formulae : 52 ( 18 unt; 18 typ; 0 def)
% Number of atoms : 55 ( 25 equ; 0 cnn)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 207 ( 27 ~; 13 |; 1 &; 159 @)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 16 ( 16 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 14 usr; 6 con; 0-3 aty)
% Number of variables : 74 ( 0 ^ 74 !; 0 ?; 74 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
pi: $tType ).
thf(decl_sort2,type,
name: $tType ).
thf(decl_sort3,type,
late_subject: $tType ).
thf(decl_sort4,type,
late_residual: $tType ).
thf(decl_23,type,
input: name > name > pi > pi ).
thf(decl_37,type,
late_BoundR: late_subject > name > pi > late_residual ).
thf(decl_39,type,
late_BoundOutputS: name > late_subject ).
thf(decl_40,type,
late_InputS: name > late_subject ).
thf(decl_41,type,
late_transitions: pi > late_residual > $o ).
thf(decl_51,type,
fresh_name_pi: name > pi > $o ).
thf(decl_54,type,
fresh_717452603ubject: name > late_subject > $o ).
thf(decl_92,type,
p: pi ).
thf(decl_94,type,
p2: pi ).
thf(decl_99,type,
aa: name ).
thf(decl_100,type,
x: name ).
thf(decl_102,type,
y: name ).
thf(decl_216,type,
esk113_1: late_subject > name ).
thf(decl_217,type,
esk114_1: late_subject > name ).
thf(fact_240_inputIneqTrans,axiom,
! [X1: name,X8: name,X4: pi,X109: late_subject,X7: name,X6: pi] :
( ( late_transitions @ ( input @ X1 @ X8 @ X4 ) @ ( late_BoundR @ X109 @ X7 @ X6 ) )
=> ~ ( fresh_717452603ubject @ X1 @ X109 ) ),
file('/export/starexec/sandbox2/tmp/tmp.bTLjSocSaC/E---3.1_1916.p',fact_240_inputIneqTrans) ).
thf(fact_237_Late__Semantics_OInput,axiom,
! [X1: name,X8: name,X4: pi] : ( late_transitions @ ( input @ X1 @ X8 @ X4 ) @ ( late_BoundR @ ( late_InputS @ X1 ) @ X8 @ X4 ) ),
file('/export/starexec/sandbox2/tmp/tmp.bTLjSocSaC/E---3.1_1916.p',fact_237_Late__Semantics_OInput) ).
thf(fact_149_subject_Oexhaust,axiom,
! [X276: late_subject] :
( ! [X277: name] :
( X276
!= ( late_InputS @ X277 ) )
=> ~ ! [X278: name] :
( X276
!= ( late_BoundOutputS @ X278 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.bTLjSocSaC/E---3.1_1916.p',fact_149_subject_Oexhaust) ).
thf(conj_0,conjecture,
x != aa,
file('/export/starexec/sandbox2/tmp/tmp.bTLjSocSaC/E---3.1_1916.p',conj_0) ).
thf(fact_42_Late__Semantics_Osubject_Odistinct_I1_J,axiom,
! [X46: name,X37: name] :
( ( late_InputS @ X46 )
!= ( late_BoundOutputS @ X37 ) ),
file('/export/starexec/sandbox2/tmp/tmp.bTLjSocSaC/E---3.1_1916.p',fact_42_Late__Semantics_Osubject_Odistinct_I1_J) ).
thf(fact_101_freshBoundDerivative_I1_J,axiom,
! [X4: pi,X160: late_subject,X8: name,X6: pi,X7: name] :
( ( late_transitions @ X4 @ ( late_BoundR @ X160 @ X8 @ X6 ) )
=> ( ( fresh_name_pi @ X7 @ X4 )
=> ( fresh_717452603ubject @ X7 @ X160 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.bTLjSocSaC/E---3.1_1916.p',fact_101_freshBoundDerivative_I1_J) ).
thf(fact_8_cClose1_Ohyps_I1_J,axiom,
late_transitions @ p @ ( late_BoundR @ ( late_InputS @ aa ) @ y @ p2 ),
file('/export/starexec/sandbox2/tmp/tmp.bTLjSocSaC/E---3.1_1916.p',fact_8_cClose1_Ohyps_I1_J) ).
thf(fact_73_Late__Semantics1_Osubject_Oinject_I1_J,axiom,
! [X105: name,X23: name] :
( ( ( late_InputS @ X105 )
= ( late_InputS @ X23 ) )
<=> ( X105 = X23 ) ),
file('/export/starexec/sandbox2/tmp/tmp.bTLjSocSaC/E---3.1_1916.p',fact_73_Late__Semantics1_Osubject_Oinject_I1_J) ).
thf(fact_3_assms_I1_J,axiom,
fresh_name_pi @ x @ p,
file('/export/starexec/sandbox2/tmp/tmp.bTLjSocSaC/E---3.1_1916.p',fact_3_assms_I1_J) ).
thf(c_0_9,plain,
! [X1: name,X8: name,X4: pi,X109: late_subject,X7: name,X6: pi] :
( ( late_transitions @ ( input @ X1 @ X8 @ X4 ) @ ( late_BoundR @ X109 @ X7 @ X6 ) )
=> ~ ( fresh_717452603ubject @ X1 @ X109 ) ),
inference(fof_simplification,[status(thm)],[fact_240_inputIneqTrans]) ).
thf(c_0_10,plain,
! [X2330: name,X2331: name,X2332: pi,X2333: late_subject,X2334: name,X2335: pi] :
( ~ ( late_transitions @ ( input @ X2330 @ X2331 @ X2332 ) @ ( late_BoundR @ X2333 @ X2334 @ X2335 ) )
| ~ ( fresh_717452603ubject @ X2330 @ X2333 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
thf(c_0_11,plain,
! [X2318: name,X2319: name,X2320: pi] : ( late_transitions @ ( input @ X2318 @ X2319 @ X2320 ) @ ( late_BoundR @ ( late_InputS @ X2318 ) @ X2319 @ X2320 ) ),
inference(variable_rename,[status(thm)],[fact_237_Late__Semantics_OInput]) ).
thf(c_0_12,plain,
! [X276: late_subject] :
( ! [X277: name] :
( X276
!= ( late_InputS @ X277 ) )
=> ~ ! [X278: name] :
( X276
!= ( late_BoundOutputS @ X278 ) ) ),
inference(fof_simplification,[status(thm)],[fact_149_subject_Oexhaust]) ).
thf(c_0_13,negated_conjecture,
x = aa,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
thf(c_0_14,plain,
! [X46: name,X37: name] :
( ( late_InputS @ X46 )
!= ( late_BoundOutputS @ X37 ) ),
inference(fof_simplification,[status(thm)],[fact_42_Late__Semantics_Osubject_Odistinct_I1_J]) ).
thf(c_0_15,plain,
! [X1: name,X3: pi,X8: name,X7: name,X2: pi,X18: late_subject] :
( ~ ( late_transitions @ ( input @ X1 @ X7 @ X2 ) @ ( late_BoundR @ X18 @ X8 @ X3 ) )
| ~ ( fresh_717452603ubject @ X1 @ X18 ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_16,plain,
! [X1: name,X7: name,X2: pi] : ( late_transitions @ ( input @ X1 @ X7 @ X2 ) @ ( late_BoundR @ ( late_InputS @ X1 ) @ X7 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
thf(c_0_17,plain,
! [X2497: late_subject] :
( ( X2497
= ( late_InputS @ ( esk113_1 @ X2497 ) ) )
| ( X2497
= ( late_BoundOutputS @ ( esk114_1 @ X2497 ) ) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
thf(c_0_18,plain,
! [X2108: pi,X2109: late_subject,X2110: name,X2111: pi,X2112: name] :
( ~ ( late_transitions @ X2108 @ ( late_BoundR @ X2109 @ X2110 @ X2111 ) )
| ~ ( fresh_name_pi @ X2112 @ X2108 )
| ( fresh_717452603ubject @ X2112 @ X2109 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_101_freshBoundDerivative_I1_J])])]) ).
thf(c_0_19,plain,
late_transitions @ p @ ( late_BoundR @ ( late_InputS @ aa ) @ y @ p2 ),
inference(split_conjunct,[status(thm)],[fact_8_cClose1_Ohyps_I1_J]) ).
thf(c_0_20,negated_conjecture,
x = aa,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_21,plain,
! [X2491: name,X2492: name] :
( ( ( ( late_InputS @ X2491 )
!= ( late_InputS @ X2492 ) )
| ( X2491 = X2492 ) )
& ( ( X2491 != X2492 )
| ( ( late_InputS @ X2491 )
= ( late_InputS @ X2492 ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_73_Late__Semantics1_Osubject_Oinject_I1_J])])]) ).
thf(c_0_22,plain,
! [X2489: name,X2490: name] :
( ( late_InputS @ X2489 )
!= ( late_BoundOutputS @ X2490 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_14])]) ).
thf(c_0_23,plain,
! [X1: name] :
~ ( fresh_717452603ubject @ X1 @ ( late_InputS @ X1 ) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_24,plain,
! [X18: late_subject] :
( ( X18
= ( late_InputS @ ( esk113_1 @ X18 ) ) )
| ( X18
= ( late_BoundOutputS @ ( esk114_1 @ X18 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_25,plain,
! [X1: name,X18: late_subject,X7: name,X3: pi,X2: pi] :
( ( fresh_717452603ubject @ X7 @ X18 )
| ~ ( late_transitions @ X2 @ ( late_BoundR @ X18 @ X1 @ X3 ) )
| ~ ( fresh_name_pi @ X7 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_26,plain,
late_transitions @ p @ ( late_BoundR @ ( late_InputS @ x ) @ y @ p2 ),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
thf(c_0_27,plain,
! [X1: name,X7: name] :
( ( X1 = X7 )
| ( ( late_InputS @ X1 )
!= ( late_InputS @ X7 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
thf(c_0_28,plain,
! [X1: name,X7: name] :
( ( late_InputS @ X1 )
!= ( late_BoundOutputS @ X7 ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_29,plain,
! [X18: late_subject] :
( ( ( late_BoundOutputS @ ( esk114_1 @ X18 ) )
= X18 )
| ~ ( fresh_717452603ubject @ ( esk113_1 @ X18 ) @ X18 ) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
thf(c_0_30,plain,
! [X1: name] :
( ( fresh_717452603ubject @ X1 @ ( late_InputS @ x ) )
| ~ ( fresh_name_pi @ X1 @ p ) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
thf(c_0_31,plain,
! [X1: name] :
( ( esk113_1 @ ( late_InputS @ X1 ) )
= X1 ),
inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_24])]),c_0_28]) ).
thf(c_0_32,plain,
fresh_name_pi @ x @ p,
inference(split_conjunct,[status(thm)],[fact_3_assms_I1_J]) ).
thf(c_0_33,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32])]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.18/0.18 % Problem : ITP192^1 : TPTP v8.1.2. Released v7.5.0.
% 0.18/0.19 % Command : run_E %s %d THM
% 0.18/0.40 % Computer : n003.cluster.edu
% 0.18/0.40 % Model : x86_64 x86_64
% 0.18/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.40 % Memory : 8042.1875MB
% 0.18/0.40 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.40 % CPULimit : 300
% 0.18/0.40 % WCLimit : 300
% 0.18/0.40 % DateTime : Fri May 3 12:48:51 EDT 2024
% 0.18/0.40 % CPUTime :
% 0.26/0.58 Running higher-order theorem proving
% 0.26/0.58 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.bTLjSocSaC/E---3.1_1916.p
% 205.98/26.82 # Version: 3.1.0-ho
% 205.98/26.82 # Preprocessing class: HSLSSMSMSSSNSFA.
% 205.98/26.82 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 205.98/26.82 # Starting new_ho_10 with 900s (3) cores
% 205.98/26.82 # Starting sh2lt with 300s (1) cores
% 205.98/26.82 # Starting new_ho_5 with 300s (1) cores
% 205.98/26.82 # Starting full_lambda_5 with 300s (1) cores
% 205.98/26.82 # Starting sh9 with 300s (1) cores
% 205.98/26.82 # Starting ehoh_best8_lambda with 300s (1) cores
% 205.98/26.82 # sh2lt with pid 2000 completed with status 0
% 205.98/26.82 # Result found by sh2lt
% 205.98/26.82 # Preprocessing class: HSLSSMSMSSSNSFA.
% 205.98/26.82 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 205.98/26.82 # Starting new_ho_10 with 900s (3) cores
% 205.98/26.82 # Starting sh2lt with 300s (1) cores
% 205.98/26.82 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 205.98/26.82 # Search class: HGHSM-SMLM31-MSFFFMBN
% 205.98/26.82 # Scheduled 6 strats onto 1 cores with 299 seconds (299 total)
% 205.98/26.82 # Starting new_ho_10 with 162s (1) cores
% 205.98/26.82 # new_ho_10 with pid 2292 completed with status 0
% 205.98/26.82 # Result found by new_ho_10
% 205.98/26.82 # Preprocessing class: HSLSSMSMSSSNSFA.
% 205.98/26.82 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 205.98/26.82 # Starting new_ho_10 with 900s (3) cores
% 205.98/26.82 # Starting sh2lt with 300s (1) cores
% 205.98/26.82 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 205.98/26.82 # Search class: HGHSM-SMLM31-MSFFFMBN
% 205.98/26.82 # Scheduled 6 strats onto 1 cores with 299 seconds (299 total)
% 205.98/26.82 # Starting new_ho_10 with 162s (1) cores
% 205.98/26.82 # Preprocessing time : 1.170 s
% 205.98/26.82 # Presaturation interreduction done
% 205.98/26.82
% 205.98/26.82 # Proof found!
% 205.98/26.82 # SZS status Theorem
% 205.98/26.82 # SZS output start CNFRefutation
% See solution above
% 205.98/26.82 # Parsed axioms : 430
% 205.98/26.82 # Removed by relevancy pruning/SinE : 180
% 205.98/26.82 # Initial clauses : 28422
% 205.98/26.82 # Removed in clause preprocessing : 17
% 205.98/26.82 # Initial clauses in saturation : 28405
% 205.98/26.82 # Processed clauses : 28838
% 205.98/26.82 # ...of these trivial : 8
% 205.98/26.82 # ...subsumed : 89
% 205.98/26.82 # ...remaining for further processing : 28741
% 205.98/26.82 # Other redundant clauses eliminated : 31
% 205.98/26.82 # Clauses deleted for lack of memory : 0
% 205.98/26.82 # Backward-subsumed : 0
% 205.98/26.82 # Backward-rewritten : 6
% 205.98/26.82 # Generated clauses : 1076
% 205.98/26.82 # ...of the previous two non-redundant : 942
% 205.98/26.82 # ...aggressively subsumed : 0
% 205.98/26.82 # Contextual simplify-reflections : 0
% 205.98/26.82 # Paramodulations : 990
% 205.98/26.82 # Factorizations : 0
% 205.98/26.82 # NegExts : 4
% 205.98/26.82 # Equation resolutions : 69
% 205.98/26.82 # Disequality decompositions : 0
% 205.98/26.82 # Total rewrite steps : 98
% 205.98/26.82 # ...of those cached : 45
% 205.98/26.82 # Propositional unsat checks : 0
% 205.98/26.82 # Propositional check models : 0
% 205.98/26.82 # Propositional check unsatisfiable : 0
% 205.98/26.82 # Propositional clauses : 0
% 205.98/26.82 # Propositional clauses after purity: 0
% 205.98/26.82 # Propositional unsat core size : 0
% 205.98/26.82 # Propositional preprocessing time : 0.000
% 205.98/26.82 # Propositional encoding time : 0.000
% 205.98/26.82 # Propositional solver time : 0.000
% 205.98/26.82 # Success case prop preproc time : 0.000
% 205.98/26.82 # Success case prop encoding time : 0.000
% 205.98/26.82 # Success case prop solver time : 0.000
% 205.98/26.82 # Current number of processed clauses : 350
% 205.98/26.82 # Positive orientable unit clauses : 77
% 205.98/26.82 # Positive unorientable unit clauses: 3
% 205.98/26.82 # Negative unit clauses : 76
% 205.98/26.82 # Non-unit-clauses : 194
% 205.98/26.82 # Current number of unprocessed clauses: 28880
% 205.98/26.82 # ...number of literals in the above : 307845
% 205.98/26.82 # Current number of archived formulas : 0
% 205.98/26.82 # Current number of archived clauses : 28384
% 205.98/26.82 # Clause-clause subsumption calls (NU) : 28956381
% 205.98/26.82 # Rec. Clause-clause subsumption calls : 37521
% 205.98/26.82 # Non-unit clause-clause subsumptions : 25
% 205.98/26.82 # Unit Clause-clause subsumption calls : 2291
% 205.98/26.82 # Rewrite failures with RHS unbound : 0
% 205.98/26.82 # BW rewrite match attempts : 44
% 205.98/26.82 # BW rewrite match successes : 7
% 205.98/26.82 # Condensation attempts : 28838
% 205.98/26.82 # Condensation successes : 4
% 205.98/26.82 # Termbank termtop insertions : 5516992
% 205.98/26.82 # Search garbage collected termcells : 191931
% 205.98/26.82
% 205.98/26.82 # -------------------------------------------------
% 205.98/26.82 # User time : 25.801 s
% 205.98/26.82 # System time : 0.211 s
% 205.98/26.82 # Total time : 26.012 s
% 205.98/26.82 # Maximum resident set size: 61464 pages
% 205.98/26.82
% 205.98/26.82 # -------------------------------------------------
% 205.98/26.82 # User time : 25.818 s
% 205.98/26.82 # System time : 0.219 s
% 205.98/26.82 # Total time : 26.037 s
% 205.98/26.82 # Maximum resident set size: 2796 pages
% 205.98/26.82 % E---3.1 exiting
% 205.98/26.82 % E exiting
%------------------------------------------------------------------------------